1-Way Multihead Quantum Finite State Automata
نویسندگان
چکیده
منابع مشابه
Path-Bounded One-Way Multihead Finite Automata
For each positive integer r ≥ 1, a nondeterministic machine M is r path-bounded if for any input word x, there are r computation paths of M on x. This paper investigates the accepting powers of pathbounded one-way (simple) multihead nondeterministic finite automata. It is shown that for each k ≥ 2 and r ≥ 1, there is a language accepted by an (r+1) path-bounded one-way nondeterministic k head f...
متن کامل2-tape 1-way Quantum Finite State Automata
1-way quantum finite state automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by 1-way quantum finite automata is a proper subset of regular languages. We introduce 2-tape 1-way quantum finite state automaton (2T1QFA(2))which is a modified version of 1-way 2-head quantum finite state automaton(1QFA(2)). In this paper, we repla...
متن کاملOn Stateless Multihead Finite Automata and Multihead Pushdown Automata
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currently scanned by its k heads, and in every such transition each head can move one cell left, right, or remain stationary. An input, which is delimited by end markers, is accepted if the machine, when started with all head...
متن کاملRemarks on Sorting and One-Way Multihead Finite Automata
Multihead one-way finite automata (l-MFA) received much attention in studies of devices of low complexity. This is because they work in linear time and because of their simplicity. On the other hand, the class of languages recognized by l-MFA is rather small. Anyway, it contains many languages important from the practical point of view. Despite the simplicity of l-MFA, many problems concerning ...
متن کاملCharacterizations of 1-Way Quantum Finite Automata
The 2-way quantum finite automaton introduced by Kondacs and Watrous[KW97] can accept non-regular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction, the acceptance power of this 1-way quantum finite automaton is reduced to a proper subset of the regular languages. In this paper we study two differe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2016
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2016.79088